Generation Method of Network Attack Graph Based On Greedy Heuristic Algorithm
نویسندگان
چکیده
منابع مشابه
Clustering Analysis based on Greedy Heuristic Algorithm
Due to increase of the mining of compressed data from various types of applications. Clustering is the process for resolving that type of applications. Traditionally we are using different clustering applications for grouping elements with equal priority. And we represent single clustering process with multi dimensional data grouping using clustering but the only problem is performance of group...
متن کاملGreedy Graph Colouring is a Misleading Heuristic
Let G = (V,E) be a (finite, simple, undirected) graph with vertex set V and edge set E. A clique in G is a set of vertices, each of which is adjacent to every other vertex in this set. The maximum clique problem is to find a largest such set in a given graph; this is NP-hard [GJ90]. We denote the size of a maximum clique by ω. A colouring of G is an assignment of vertices to colours such that n...
متن کاملAttack Graph Based Evaluation of Network Security
The perspective directions in evaluating network security are simulating possible malefactor’s actions, building the representation of these actions as attack graphs (trees, nets), the subsequent checking of various properties of these graphs, and determining security metrics which can explain possible ways to increase security level. The paper suggests a new approach to security evaluation bas...
متن کاملA Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm
The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...
متن کاملA New Alert Correlation Algorithm Based on Attack Graph
Intrusion Detection Systems (IDS) are widely deployed in computer networks. As modern attacks are getting more sophisticated and the number of sensors and network nodes grows, the problem of false positives and alert analysis becomes more difficult to solve. Alert correlation was proposed to analyze alerts and to decrease false positives. Knowledge about the target system or environment is usua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Hybrid Information Technology
سال: 2017
ISSN: 1738-9968,1738-9968
DOI: 10.14257/ijhit.2017.10.6.03